A sliding time window heuristic for open pit mine block sequencing
نویسندگان
چکیده
منابع مشابه
A sliding time window heuristic for open pit mine block sequencing
The open pit mine block sequencing problem (OPBS) seeks a discrete-time production schedule that maximizes the net present value of the orebody extracted from an open-pit mine. This integer program (IP) discretizes the mine’s volume into blocks, imposes precedence constraints between blocks, and limits resource consumption in each time period. We develop a “sliding time window heuristic” to sol...
متن کاملOpen-Pit Block-Sequencing Formulations: A Tutorial
A classical problem in the mining industry for open-pit mines involves scheduling the production of notional three-dimensional production blocks, each containing a predetermined amount of ore and waste. That is, given operational resource constraints on extraction and processing, we seek a net present value-maximizing schedule of when, if ever, to extract each block in a deposit. We present a v...
متن کاملA genetic algorithm approach for open-pit mine production scheduling
In an Open-Pit Production Scheduling (OPPS) problem, the goal is to determine the mining sequence of an orebody as a block model. In this article, linear programing formulation is used to aim this goal. OPPS problem is known as an NP-hard problem, so an exact mathematical model cannot be applied to solve in the real state. Genetic Algorithm (GA) is a well-known member of evolutionary algorithms...
متن کاملAggregation heuristic for the open-pit block scheduling problem
In order to establish a production plan, an open-pit mine is partitioned into a three-dimensional array of blocks. The order in which blocks are extracted and processed has a dramatic impact on the economic value of the exploitation. Since realistic models have millions of blocks and constraints, the combinatorial optimization problem of finding the extraction sequence that maximizes the profit...
متن کاملA Comprehensive Study of Several Meta-Heuristic Algorithms for Open-Pit Mine Production Scheduling Problem Considering Grade Uncertainty
It is significant to discover a global optimization in the problems dealing with large dimensional scales to increase the quality of decision-making in the mining operation. It has been broadly confirmed that the long-term production scheduling (LTPS) problem performs a main role in mining projects to develop the performance regarding the obtainability of constraints, while maximizing the whole...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optimization Letters
سال: 2011
ISSN: 1862-4472,1862-4480
DOI: 10.1007/s11590-011-0306-2